Memory Management Schemes for Radiosity Computation in Complex Environments Daniel Meneveaux, Kadi Bouatouch and Eric Maisel
نویسندگان
چکیده
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is performed only for this resident subset which changes during the resolution process. This change entails many read and write operations from or onto the disk. These disk transfers must be ordered to make the radiosity algorithms tractable. We propose in this paper diierent ordering strategies which can be seen as complementary to those devised by Teller 1]. La radiosit e hierarchique est un processus tr es co^ uteux en terme de temps de calcul et de ressources m emoire, m^ eme pour des sc enes de complexit e moyenne. Pour traiter des environ-nements complexes ne tenant pas en m emoire, de nouvelles solutions sont a envisager. L'une d'entre elle consiste a structurer la sc ene en sous-ensembles de polygones et ne conserver en m emoire qu'une partie d'entre eux. Les calculs de radiosit e sont eeectu es seulement pour ces sous-ensembles r esidant en m emoire et pouvant changer au cours du temps. Ces change-ments provoquent de nombreuses op erations de lecture et d' ecriture sur disque. Cependant, il est possible de r eduire les temps de calculs en ordonnant eecacement ces transferts de donn ees. Nous proposons dans ce rapport dii erentes strat egies d'ordonnancement pouvant ^ etre consid er ees comme compl ementaires a celles d ecrites par Teller dans 1].
منابع مشابه
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...
متن کاملParallel Radiosity Using a Shared Virtual Memory
The radiosity method is a very demanding process in terms of computing and memory resources. To cope with these problems, parallel solutions have been proposed in the literature. These solutions are outlined and classiied in this paper. A new parallel solution, based on the use of a shared virtual memory (SVM), is proposed. It will be shown that this concept of SVM greatly simpliies the impleme...
متن کاملDaniel Meneveaux , Eric Maisel and Kadi Bouatouch
Computing global illumination in a moderate time for complex environments and walking through them is one of the challenges in computer graphics. To meet this goal, a prepro-cessing is necessary. This preprocessing consists in partitioning the environment into cells and determining visibility between these cells. Most of the existing partitioning methods rely on the Binary Space Partitioning te...
متن کاملSimulation of the indoor propagation of a 60 GHz electromagnetic wave with a time-dependent radiosity algorithm
متن کامل
Linear Radiosity with Error Estimation
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in [1] for constant radiosity method, we compute lower and upper linear bounds of the actual radiosity function over the surface elements. We carry out this by computing linear upper and lower bounds of the kernel of the radiosity equation. Also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998